Fast Dynamic Pointer Following via Link-Cut Trees
نویسندگان
چکیده
In this paper, we study the problem of fast dynamic pointer following: given a directed graph G where each vertex has outdegree 1, efficiently support the operations of i) changing the outgoing edge of any vertex, and ii) find the vertex k vertices ‘after’ a given vertex. We exhibit a solution to this problem based on link-cut trees that requires O(lgn) time per operation, and prove that this is optimal in the cell-probe complexity model.
منابع مشابه
Optimal Algorithms for Nding Nearest Common Ancestors in Dynamic Trees
We consider the problem of nding the nearest common ancestor of two given nodes x and y (denoted by nca(x; y)) in a collection of dynamic rooted trees. Interspersed with nca-queries are on-line commands link(x; y) where x but not necessarily y is a tree root. The eeect of a command link(x; y) is to combine the trees containing x and y by making y the parent of x. We present a pointer machine al...
متن کامل2 Euler-tour Trees
In the last lecture we discussed the link-cut tree: a dynamic tree that achieves O(lg n) amortized time per operation. In this lecture, leave the BST model and enter the pointer-machine model. In this model, we are allowed to have nodes which each hold O(1) pointers and O(1) fields (e.g. integers). Our machine is also allowed to keep track of O(1) “fingers” to nodes at a time. The operations we...
متن کامل2 Euler Tour Trees
In the last lecture we discussed the link-cut tree: a dynamic tree that achieves O(lg n) amortized time per operation. In this lecture, we leave the BST model and enter the pointer-machine model. In this model, we are allowed to have nodes which each hold O(1) pointers and O(1) fields (e.g. integers). Our machine is also allowed to keep track of O(1) “fingers” to nodes at a time. The operations...
متن کاملComputational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees
We present efficient Pure Pointer Machine (PPM) algorithms to test for “leftness” in dynamic search trees and related problems. In particular, we show that the problem of testing if a node x is in the leftmost branch of the subtree rooted in node y, in a dynamic tree that grows and shrinks at the leaves, can be solved on PPMs in worst-case O((lg lg n)) time per operation in the semidynamic case...
متن کاملLecture 17 — April 8 , 2010
Euler Tour trees are due to Henzinger and King [1] and are an alternative to link-cut trees for representing dynamic trees. Euler tour trees are simpler and easier to analyze than link-cut trees, but do not naturally store aggregate information about paths in the tree. Euler tour trees are well suited for storing aggregate information on subtrees, which is a feature we will use in the next sect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1405.3739 شماره
صفحات -
تاریخ انتشار 2014